#define quickread
#ifdef quickread
#include <cstdio> 
template <typename T>
inline void read(T& x)
{
    int c=getchar(), f=1; x=0;
    while(c<'0'||'9'<c) {if(c=='-') f=-1; c=getchar();}
    while('0'<=c&&c<='9') 
        x=(x<<3)+(x<<1)+c-'0', c=getchar();
    x*=f;
}
template <typename T>
inline void quickwrite(T x)
{
    if(x<0) putchar('-'), x*=-1;
    if(x>=10) quickwrite(x/10);
    putchar(x%10+'0');
}
#else 
#include <iostream>
#endif
using namespace std;
#define DEBUG

int n, p;
int cnt;
void init()
{

}

void work(int g)
{
    int s=0, c=0, t=0; //金银铜铁
    //初始全是金牌，依次向下枚举
    for(g; g>0; g--)
    {
        for(s=g<<1; s>0; s--)
        {
            c=n-8*g-4*s; //剩余的铁
            cnt+=(c-c/2); //全铜->全铁
        }
    }
}

void solve()
{
    read(n), read(p);
    for(int i=1; i<=n; i++)
    {
        // printf("%d>=%d\n", i<<2, p);
        cnt=0;
        if(4*i>=p) work(i);//最大亮光存在无解可能
        printf("%d ", cnt);        
    }
    puts("");
}

// #undef DEBUG
signed main()
{
    #ifdef DEBUG
        freopen("../in.txt", "r", stdin);
        freopen("../out.txt", "w", stdout);
    #endif
    #ifndef quickread
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #endif

    int T=1; //scanf("%d", &T);
    while(T--) 
    {
        solve();
    }
    return 0;
}
